16 research outputs found
A Network Congestion control Protocol (NCP)
The transmission control protocol (TCP) which is the dominant
congestion control protocol at the transport layer is proved to have
many performance problems with the growth of the Internet. TCP for
instance results in throughput degradation for high bandwidth delay
product networks and is unfair for flows with high round trip delays.
There have been many patches and modifications to TCP all of which
inherit the problems of TCP in spite of some performance improve-
ments.
On the other hand there are clean-slate design approaches of the
Internet. The eXplicit Congestion control Protocol (XCP) and the
Rate Control Protocol (RCP) are the prominent clean slate congestion
control protocols. Nonetheless, the XCP protocol is also proved to
have its own performance problems some of which are its unfairness
to long flows (flows with high round trip delay), and many per-packet
computations at the router. As shown in this paper RCP also makes
gross approximation to its important component that it may only give
the performance reports shown in the literature for specific choices of
its parameter values and traffic patterns.
In this paper we present a new congestion control protocol called
Network congestion Control Protocol (NCP). We show that NCP can
outperform both TCP, XCP and RCP in terms of among other things
fairness and file download times.unpublishe
Dynamic Mapping of an AS Network into A Smaller Network of Border Routers
In this paper we present a cross layer routing and congestion control scheme which can map an enterprise network into a smaller network of boarder routers. One of the boarder routers in our scheme called a main node computes the virtual link (tunnel) capacities and corresponding queue size for each path of the ingress routers. This main node can use cloud computing to speed up computation. The scheme can make clean-slate
protocols easily deployable in the current Internet with out the need of making changes in the core routers. Besides, the scheme makes online dynamic network diagnosis and analysis easier.unpublishednot peer reviewe
A Network Congestion Control Protocol to More Quickly Finish Flows
The transmission control protocol (TCP) is the major trans-
port protocol in the Internet. TCP and its variants have the
drawback of not accurately knowing rate share of flows at
bottleneck links. Some protocols proposed to address these
drawbacks are not fair to short flows, which are the majority
of the Internet traffic. Other protocols result in high queue
length and packet drops which translate into a high average
flow completion time (AFCT).
In this paper we present the design and analysis of a
Quick congestion Control Protocol (QCP). QCP can quickly
give flows their fair share rates hence allow them to quickly
finish. Unlike existing schemes, QCP uses an accurate for-
mula to calculate the number of flows sharing a network
link. This enables QCP to get fair share rates to flows with-
out over or under-utilization of bottleneck link capacities.
We also present an efficient sharing mechanism which QCP
uses to assign capacity which is not used by some flows bot-
tlenecked elsewhere to other flows which need the capacity.
We show how QCP can be implemented by extending the
emerging OpenFlow architecture. Simulation results confirm
the design goals of QCP in achieving reduced AFCT (by
upto 30%).published or submitted for publicationnot peer reviewe
An efficient queue management (EQM) technique for networks
In this paper I present a simple and efficient queue management (EQM) technique based on optimal bandwidth allocation for networks. Each router calculates the bandwidth share (throughput)(1) of each interfering flow at a link using link capacity and Interface IP Address (see RFC 3630) or round trip time (RTT) and congestion window size of the flows which are carried in the packets. The sources send packets and the routers in the path drop or allow the packets based on a certain probability and label the non-dropped packets with the allowable optimal throughput for the next round. Each router in the path modifies this label and the sources eventually adjust their sending rates based on the allowable throughput they get from the returning ACKs. In this way EQM finds the fair bandwidth allocation and gives fair queue management.
I also a prove that EQM can converge to a stable point